Triangular imbedding of Kn − K6

Triangular Cayley maps of Kn, n, n

Regular hamiltonian embeddings of Kn, n and regular triangular embeddings of Kn, n, n

We give a group-theoretic proof of the following fact, proved initially by methods of topological design theory: Up to isomorphism, the number of regular hamiltonian embeddings of Kn,n is 2 or 1, depending on whether n is a multiple of 8 or not. We also show that for each n there is, up to isomorphism, a unique regular triangular embedding of Kn,n,n. This is a preprint of an article accepted fo...

The linear 3-arboricity of Kn, n and Kn

A linear k-forest is a forest whose components are paths of length at most k. The linear k-arboricity of a graph G, denoted by lak(G), is the least number of linear k-forests needed to decompose G. In this paper, we completely determine lak(G) when G is a balanced complete bipartite graph Kn,n or a complete graph Kn, and k = 3. © 2007 Elsevier B.V. All rights reserved.

Bishellable drawings of Kn

The Harary-Hill conjecture, still open after more than 50 years, asserts that the crossing number of the complete graph Kn is H(n) = 1 4 ⌊ n 2 ⌋⌊ n− 1 2 ⌋⌊ n− 2 2 ⌋⌊ n− 3 2 ⌋ . Ábrego et al. [3] introduced the notion of shellability of a drawing D of Kn. They proved that if D is s-shellable for some s ≥ b 2 c, then D has at least H(n) crossings. This is the first combinatorial condition on a dr...

Generalized Invariant Imbedding Relation.